Boolean dependence logic and partially-ordered connectives
نویسندگان
چکیده
منابع مشابه
Boolean Dependence Logic and Partially-Ordered Connectives
We introduce a new variant of dependence logic (D) called Boolean dependence logic (BD). In BD dependence atoms are of the type =(x1, . . . , xn, α), where α is a Boolean variable. Intuitively, with Boolean dependence atoms one can express quantification of relations, while standard dependence atoms express quantification over functions. We compare the expressive power of BD to D and first-orde...
متن کاملFinite model theory for partially ordered connectives ∗
In the present article a study of the finite model theory of Henkin quantifiers with boolean variables [5], a.k.a. partially ordered connectives [28], is undertaken. The logic of first-order formulae prefixed by partially ordered connectives, denoted D, is considered on finite structures. D is characterized as a fragment of second-order existential logic Σ1; the formulae of the relevant fragmen...
متن کاملPartially Ordered Connectives and Sum11 on Finite Models
In this paper we take up the study of Henkin quantifiers with boolean variables [4] also known as partially ordered connectives [19]. We consider first-order formulae prefixed by partially ordered connectives, denoted D, on finite structures. We characterize D as a fragment of second-order existential logic Σ 1♥ whose formulae do not allow for existential variables being argument of predicate v...
متن کاملBoolean algebras over partially ordered sets
Being the crossroads between Algebra, Topology, Logic, Set Theory and the Theory of Order; the class of Boolean algebras over partially ordered sets were look at as one of the sources, providing over time, new insights in Boolean algebras. Some constructions and their interconnections will be discussed, motivating along the way a list of open problems. Mathematics Subject Classification (MSC 20...
متن کاملPseudo Boolean Programming for Partially Ordered Genomes
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, number of adjacencies, number of reversals, etc. These measures are classically used between two totally ordered genomes. However, genetic mapping techniques often give rise to different maps with some unordered genes. Sta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2017
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2017.03.009